Refinement of Representation Theorems for Context-Free Languages

An Intuitve Representation of Context-Free Languages

1. In this paper, the following conception of languageis used. A l~guage is an ordered triple L = (V, C, f) where V and C are two disjoint, non-empty, finite sets and f is sn application of C into the set of all subsets of the free semigroup F(~ generated by ¥. The set V is called the vocabulary (in Chomsky ~1~, terminalvocabu-lary), its elements are called word_____~s, those of F(V) Ford strin...

A Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages

We prove a Chomsky-Schützenberger representation theorem for weighted multiple context-free languages.

Logics For Context-Free Languages

Erklärung Hiermit versichere ich, dass ich die vorliegende Masterarbeit selbstständig verfasst und keine anderen Quellen und Hilfsmittel als die angegebenen benutzt habe.

Context - Free Languages and

A complete refinement procedure for regular separability of context-free languages

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present a class of semi-decision procedures for regular separability of context-free languages, based on counter-example guided abstraction refinement. We propose two effective instances of this approach, one that is complete but relatively expensive, and ...